Hypergraphs without exponents
نویسندگان
چکیده
A short, concise proof is given for that k≥5 there exists a k-uniform hypergraph H without exponent, i.e., when the Turán function not polynomial in n. More precisely, we have ex(n,H)=o(nk−1) but it exceeds nk−1−c any positive c n>n0(k,c). We conjecture this true k∈{3,4} as well.
منابع مشابه
Percolation fractal exponents without scaling
Classically, percolation critical exponents are linked to the power laws that characterize percolation cluster fractal properties. It is found here that the gradient percolation power laws are conserved even for extreme gradient values for which the frontier of the infinite cluster is no more fractal. In particular the exponent 7/4 which was recently demonstrated to be the exact value for the d...
متن کاملMaximum hypergraphs without regular subgraphs
We show that an n-vertex hypergraph with no r-regular subgraph has at most 2n−1 + r− 2 edges. We conjecture that if n > r, then every n-vertex hypergraph with no r-regular subgraph having the maximum number of edges contains a full star, that is, 2n−1 distinct edges containing a given vertex. We prove this conjecture for n ≥ 425. The condition that n > r cannot be weakened.
متن کاملOn 3-uniform hypergraphs without linear cycles∗
We explore properties of 3-uniform hypergraphs H without linear cycles. It is surprising that even the simplest facts about ensuring cycles in graphs can be fairly complicated to prove for hypergraphs. Our main results are that 3-uniform hypergraphs without linear cycles must contain a vertex of strong degree at most two and must have independent sets of size at least 2|V (H)| 5 .
متن کاملThe Number of Hypergraphs without Linear Cycles
The r-uniform linear k-cycle C k is the r-uniform hypergraph on k(r−1) vertices whose edges are sets of r consecutive vertices in a cyclic ordering of the vertex set chosen in such a way that every pair of consecutive edges share exactly one vertex. Here, we prove a balanced supersaturation result for linear cycles which we then use in conjunction with the method of hypergraph containers to sho...
متن کاملPercolation fractal exponents without fractal geometry
Classically, percolation critical exponents are linked to the power laws that characterize percolation cluster fractal properties. It is found here that the gradient percolation power laws are conserved even for extreme gradient values for which the frontier of the infinite cluster is no more fractal. In particular the exponent 7/4 which was recently demonstrated to be the exact value for the d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2021
ISSN: ['0097-3165', '1096-0899']
DOI: https://doi.org/10.1016/j.jcta.2021.105517